The Minimum Stretch Spanning Tree Problem for Typical Graphs

With applications in communication networks, the minimum stretch spanning tree problem is to find a T of graph G such that maximum distance between two adjacent vertices minimized. The has been proved NP-hard and fixed-parameter polynomial algorithms have obtained for some special families graphs. In this paper, we concentrate on optimality characterizations typical classes We determine exact formulae complete k-partite graphs, split generalized convex several planar grids, including rectangular triangular triangulated-rectangular grids.